Crude Oil Short-Term Scheduling Algorithm with Multiple Charging Tanks Charging a Distiller Overlapingly Based on Priority-Slot Continuous-Time Formulation
نویسنده
چکیده
The optimal scheduling of crude-oil operation in refineries has been researched by various groups during the past decade. Different mixed integer linear programming or mixed nonlinear programming formulations are derived. This paper proposes a novel MINLP formulation with multiple charging tanks charging a distiller overlapingly and oil residency time constraint that is based on multi-operation sequencing with synchronized start time (MOS-SST). It is different from previous formulations because of its consideration for oil residency time constraint and multiple charging tanks charging a distiller overlapingly. A branch and bound algorithm combined with the Lagrangian Relaxation Subgradient Optimization algorithm is proposed to solve this model, resulting in a satisfactory optimal result.
منابع مشابه
Efficient short-term scheduling of refinery operations based on a continuous time formulation
The problem addressed in this work is to develop a comprehensive mathematical programming model for the efficient scheduling of oil-refinery operations. Our approach is first to decompose the overall problem spatially into three domains: the crude-oil unloading and blending, the production unit operations and the product blending and delivery. In particular, the first problem involves the crude...
متن کاملShort-term Scheduling of Refinery Operations Based on a Continuous Time Formulation
The problem addressed in this work is to develop a comprehensive mathematical programming model for the efficient scheduling of oil-refinery operations. Our approach is first to decompose the overall problem spatially into three domains: the crude-oil unloading and blending, the production-unit operations and the product blending and delivery. In particular, the first problem involves the crude...
متن کاملNew Continuous-Time Formulation and Algorithm for Crude-Oil Scheduling Problems with Oil Residency Time Constraint and Pipeline Transportation
The optimal scheduling of crude-oil operation in refineries has been studied by various groups during the past decade, leading to different mixed integer linear programming or mixed nonlinear programming formulations. This paper proposes a new MINLP formulation with an oil residency time constraint and common pipeline transportation that is based on single-operation sequencing (SOS). An effecti...
متن کاملScheduling and Stochastic Capacity Estimation of an EV Charging Station with PV Rooftop Using Queuing Theory and Random Forest
Power capacity of EV charging stations could be increased by installing PV arrays on their rooftops. In these charging stations, power transmission can be two-sided when needed. In this paper a new method based on queuing theory and random forest algorithm proposed to calculate net power of charging station considering random SOC of EV’s. Due to estimation time constraints, a queuing model with...
متن کاملPriority-Slot-Based Continuous-Time MINLP Formulation for Crude-Oil Scheduling Problem with Two-Pipeline Transportation
Some oil refineries arrange low-fusion-point crude oil storage tanks and ones containing high-fusionpoint crude oil at two diverse locations. Refinery needs different pipeline to transport different fusion point oil, so, to transport diverse fusion point oil it needs two pipelines. Because of the constraints resulted from transporting high-fusion-point oil, to schedule such a system is very har...
متن کامل